Efficient Generation of Correctness Certificates for the Abstract Domain of Polyhedra
نویسندگان
چکیده
Domain of Polyhedra Alexis Fouilhé, David Monniaux, Michaël Périn To cite this version: Alexis Fouilhé, David Monniaux, Michaël Périn. Efficient Generation of Correctness Certificates for the Abstract Domain of Polyhedra. Francesco Logozzo, Manuel Fähndrich. 20th static analysis symposium (SAS), Jun 2013, Seattle, Washington, United States. Springer, 7935, pp.345-365, 2013, <10.1007/978-3-642-38856-9 19>. HAL Id: hal-00806990 https://hal.archives-ouvertes.fr/hal-00806990 Submitted on 2 Apr 2013 HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés. Efficient Generation of Correctness Certificates for the Abstract Domain of Polyhedra∗ Alexis Fouilhé† David Monniaux‡ Michaël Périn∗
منابع مشابه
Modular and lightweight certification of polyhedral abstract domains ∗
interpretation [5] provides a theory for static analysis of programs, where sets of reachable states are over-approximated by elements of an abstract domain. In particular, the domain of convex polyhedra [6] expresses postconditions as conjunctions of affine inequalities: a polyhedron p encodes a formula “ ∧ i ∑ j aij .xj≤bi”, where aij and bi are rational constants, and xj are numerical variab...
متن کاملA Linearization Technique for Multivariate Polynomials Using Convex Polyhedra Based on Handelman-Krivine's Theorem
We present a new linearization method to over-approximate non-linear multivariate polynomials with convex polyhedra. It is based on Handelman-Krivine’s theorem and consists in using products of constraints of a polyhedron to over-approximate a polynomial on this polyhedron. We implemented it together with two other linearization methods that we will not detail in this paper, but that we shall u...
متن کاملA An Abstract Model of Certificate Translation
A certificate is a mathematical object that establishes the validity of a logical formula and that is self-contained, self-explanatory, and can be checked independently and automatically. Certificates arise naturally in many areas of mathematics, and in many different forms. In particular, certificates are common in the context of program verification, where they are used for automatic checking...
متن کاملResult certification for relational program analysis
We define a generic relational program analysis for an imperative, stack-oriented byte code language with procedures, arrays and global variables and instantiate it with an abstract domain of polyhedra. The analysis has automatic inference of loop invariants and method pre-/post-conditions, and efficient checking of analysis results by a simple checker. Invariants, which can be large, can be sp...
متن کاملSampling Rate Conversion in the Discrete Linear Canonical Transform Domain
Sampling rate conversion (SRC) is one of important issues in modern sampling theory. It can be realized by up-sampling, filtering, and down-sampling operations, which need large complexity. Although some efficient algorithms have been presented to do the sampling rate conversion, they all need to compute the N-point original signal to obtain the up-sampling or the down-sampling signal in the tim...
متن کامل